Bilevel programming approaches to production planning for multiple products with short life cycles
نویسندگان
چکیده
منابع مشابه
Inventory policy for products with short life cycles
The unanticipated shortening of a product’s life cycle can have a dramatic effect on inventory costs. Where the cause is physical decay or an unexpected decline in demand, producers can quickly find themselves quickly holding inventory that has degraded value or no value at all. In this research, we propose that an inventory system with this characteristic can be modeled as a Markov Process wit...
متن کاملTrust Region Approaches for Nonlinear Bilevel Programming
Bilevel programs form a class of hierarchical optimzation problems in which the constraint set is not explicit but is defined in terms of another optimization problem. Optimization problems in several real-life domains can be expressed as bilevel programs, making such problems ubiquitous. In this term paper, we analyze a trust region approach for solving a special case of this problem.
متن کاملBILEVEL LINEAR PROGRAMMING WITH FUZZY PARAMETERS
Bilevel linear programming is a decision making problem with a two-level decentralized organization. The textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. Making a decision at one level affects that at the other one. In this paper, bilevel linear programming with inexact parameters has been studied and a method is...
متن کاملAdaptive aggregate production planning with fuzzy goal programming approach
Aggregate production planning (APP) determines the optimal production plan for the medium term planning horizon. The purpose of the APP is effective utilization of existing capacities through facing the fluctuations in demand. Recently, fuzzy approaches have been applied for APP focusing on vague nature of cost parameters. Considering the importance of coping with customer demand in different p...
متن کاملProduction planning problem with sequence dependent setups as a bilevel programming problem
Each of n products is to be processed on two machines in order to satisfy known demands in each of T periods. Only one product can be processed on each machine at any given time. Each switch from one item to another requires sequence dependent setup time. The objective is to minimize the total setup time and the sum of the costs of production, storage and setup. We consider the problem as a bil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2019
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-019-00407-z